Uniqueness Typing Simplified
نویسندگان
چکیده
We present a uniqueness type system that is simpler than both Clean’s uniqueness system and a system we proposed previously. The new type system is straightforward to implement and add to existing compilers, and can easily be extended with advanced features such as higher rank types and impredicativity. We describe our implementation in Morrow, an experimental functional language with both these features. Finally, we prove soundness of the core type system with respect to the call-by-need lambda calculus.
منابع مشابه
Derivation System for Uniqueness TypingErik
We present two systems for rst-order typing of graph expressions, in natural deduction style: conventional typing and (polymorphic) uniqueness typing. In both type systems, typing is preserved during evaluation, and types can be determined eeectively.
متن کاملUniqueness Typing in Natural Deduction Style
We present two type systems for graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles traditiona...
متن کاملA Simplified Van Erth Single Nucleotide Polymorphism (SNP) Typing Method of Bacillus Anthracis Applicable by Traditional Thermocycler Machines
Abstract SNP typing is now a well-established genotyping system in Bacillus anthracis studies. In the original standard method of Van Erth, SNPs at 13 loci of the B. anthracis genome were analyzed. In order to simplify and make appropriate this expensive method to low-budget laboratory settings, 13 primer pairs targeting the 13 corresponding SNPs were designed. Besides, a universal PCR proto...
متن کاملUniqueness Typing for Functional Languages with Graph Rewriting Semantics
We present two type systems for term graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles tradi...
متن کاملEquality-Based Uniqueness Typing
Uniqueness typing can be used to add side effects to a functional programming language without losing referential transparency. Unfortunately uniqueness types often involve implications between uniqueness attributes, which complicates type inference and incorporating modern extensions such as arbitrary rank types. In this paper we show how to avoid these difficulties by recoding attribute inequ...
متن کامل